On the computation of Graver test sets
نویسنده
چکیده
We present a uniied approach to Graver test sets in LP and IP that is inspired by the critical pair/completion procedure arising in computational algebra. Our algorithms for computing test sets entirely work in the kernel of the problem matrix.
منابع مشابه
Test Sets for Integer Programs with Z-Convex Objective
In this paper we extend test set based augmentation methods for integer linear programs to programs with more general convex objective functions. We show existence and computability of finite test sets for these wider problem classes by providing an explicit relationship to Graver bases. One candidate where this new approach may turn out fruitful is the Quadratic Assignment Problem.
متن کاملExploiting Symmetries in the Computation of Graver Bases
Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this paper we present a Graver basis algorithm for sublattices of Zn that exploits existing symmetry.
متن کاملFiniteness Theorems in Stochastic Integer Programming
We study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finitely many “building blocks”, independent of the number of scenarios, and we give an effective procedure to compute them. The paper includes an introduction to Nash-Williams’ theory of better-quasi-orderings, which is u...
متن کاملTest sets of the knapsack problem and simultaneous diophantine approximation
Absact This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral solutions of linear diophantine equations. We present best possible inequalities that must be satisfied by all minimal integral solutions of a linear diophantine equation and prove that for the co...
متن کاملTest Sets of the Knapsack Problem and Simultaneous Diophantine Approximations
This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral solutions of linear diophantine equations. We present best possible inequalities that must be satisfied by all minimal integral solutions of a linear diophantine equation and prove that for the correspon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999